Quantum complexity theory

Results: 258



#Item
71Composition of Zero-Knowledge Proofs with Efficient Provers∗ Eleanor Birrell† Salil Vadhan‡

Composition of Zero-Knowledge Proofs with Efficient Provers∗ Eleanor Birrell† Salil Vadhan‡

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2009-12-07 14:26:58
72Capabilities and Limitations of Quantum Computers Simone Severini Cambrige, ACK: Fernando Brandao (UCL), Aram Harrow (MIT/UCL),

Capabilities and Limitations of Quantum Computers Simone Severini Cambrige, ACK: Fernando Brandao (UCL), Aram Harrow (MIT/UCL),

Add to Reading List

Source URL: www.turing-gateway.cam.ac.uk

Language: English - Date: 2014-09-23 05:58:31
73On complexity of the quantum Ising model Sergey Bravyi∗ Matthew Hastings†  Abstract

On complexity of the quantum Ising model Sergey Bravyi∗ Matthew Hastings† Abstract

Add to Reading List

Source URL: www.quantum-lab.org

Language: English - Date: 2014-11-28 23:30:58
74Quantum Algorithm for Monotonicity Testing on the Hypercube Aleksandrs Belovs ∗  Eric Blais

Quantum Algorithm for Monotonicity Testing on the Hypercube Aleksandrs Belovs ∗ Eric Blais

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2015-03-10 20:22:32
75A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness arXiv:1412.5484v1 [cs.CC] 17 DecSheela Devadas∗ and Ronitt Rubinfeld†

A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness arXiv:1412.5484v1 [cs.CC] 17 DecSheela Devadas∗ and Ronitt Rubinfeld†

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2014-12-17 20:29:41
76A Communication Lower Bounds Using Directional Derivatives ALEXANDER A. SHERSTOV, University of California, Los Angeles We study the set disjointness problem in the most powerful model of bounded-error communication, the

A Communication Lower Bounds Using Directional Derivatives ALEXANDER A. SHERSTOV, University of California, Los Angeles We study the set disjointness problem in the most powerful model of bounded-error communication, the

Add to Reading List

Source URL: www.cs.ucla.edu

Language: English - Date: 2014-06-25 14:31:55
77The non-adaptive query complexity of testing k-parities

The non-adaptive query complexity of testing k-parities

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2013-07-24 10:17:39
78Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?∗ Hirotada Kobayashia b †   Keiji Matsumotoa b ‡

Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?∗ Hirotada Kobayashia b † Keiji Matsumotoa b ‡

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2009-07-17 07:53:04
79Interactive proofs with efficient quantum prover for recursive Fourier sampling

Interactive proofs with efficient quantum prover for recursive Fourier sampling

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2012-09-21 16:35:50
80Best Result: Substance Name Methylmercury (MeHg) IRIS  Tox Review/ 

Best Result: Substance Name Methylmercury (MeHg) IRIS  Tox Review/ 

Add to Reading List

Source URL: www.dtsc.ca.gov

Language: English - Date: 2013-08-23 12:03:14